-
1 незацикливающийся автомат
Русско-английский словарь по вычислительной технике и программированию > незацикливающийся автомат
-
2 незацикливающийся автомат
Русско-английский большой базовый словарь > незацикливающийся автомат
-
3 незацикливающийся автомат
halting automaton мат.Русско-английский научно-технический словарь Масловского > незацикливающийся автомат
-
4 цифровой автомат
1. digital automaton2. digital network, digital circuitРусско-английский большой базовый словарь > цифровой автомат
-
5 бесконечный автомат
Русско-английский большой базовый словарь > бесконечный автомат
-
6 двусторонний автомат
Русско-английский большой базовый словарь > двусторонний автомат
-
7 дискретный автомат
Русско-английский большой базовый словарь > дискретный автомат
-
8 канонический анализирующий автомат
Русско-английский большой базовый словарь > канонический анализирующий автомат
-
9 стохастический автомат
Русско-английский большой базовый словарь > стохастический автомат
-
10 незацикливающийся автомат
Information technology: halting automatonУниверсальный русско-английский словарь > незацикливающийся автомат
См. также в других словарях:
Computability theory (computer science) — In computer science, computability theory is the branch of the theory of computation that studies which problems are computationally solvable using different models of computation.Computability theory differs from the related discipline of… … Wikipedia
Computability — You might be looking for Computable function, Computability theory, Computation, or Theory of computation. Computability is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within… … Wikipedia
Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia
Quantum finite automata — In quantum computing, quantum finite automata or QFA are a quantum analog of probabilistic automata. They are related to quantum computers in a similar fashion as finite automata are related to Turing machines. Several types of automata may be… … Wikipedia
Machine that always halts — In computability theory, a machine that always halts also called a decider (Sipser, 1996) or a total Turing machine (Kozen, 1997) is a Turing machine that halts for every input. Because it always halts, the machine is able to decide whether a… … Wikipedia
List of computability and complexity topics — This is a list of computability and complexity topics, by Wikipedia page. Computability theory is the part of the theory of computation that deals with what can be computed, in principle. Computational complexity theory deals with how hard… … Wikipedia
Turing completeness — For the usage of this term in the theory of relative computability by oracle machines, see Turing reduction. In computability theory, a system of data manipulation rules (such as an instruction set, a programming language, or a cellular… … Wikipedia
Tag system — A tag system is a deterministic computational model published by Emil Leon Post in 1943 as a simple form of Post canonical system. A tag system may also be viewed as an abstract machine, called a Post tag machine (not to be confused with Post… … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Chomsky hierarchy — Within the field of computer science, specifically in the area of formal languages, the Chomsky hierarchy (occasionally referred to as Chomsky–Schützenberger hierarchy) is a containment hierarchy of classes of formal grammars. This hierarchy of… … Wikipedia
Rice's theorem — In computer science, Rice s theorem named after Henry Gordon Rice (also known as The Rice Myhill Shapiro theorem after Rice and John Myhill) states that, for any non trivial property of partial functions, there exists at least one algorithm for… … Wikipedia